The Structure of Models of Uncountably Categorical Theories

ثبت نشده
چکیده

The natural notion of categoricity, as it was discovered in the 1930's, is degenerate for first order languages, since only a finite structure can be described up to isomorphism by its first order theory. This has led to a new notion of categoricity. A theory is said to be categorical in a power if it has a model of this power which is unique up to isomorphism. Morley has proved, answering the well-known question of îioê, that for the spectrum of the infinite powers in which a given first order theory is categorical, the only possibilities are: (i) all infinite powers, (ii) all uncountable powers, (iii) «o, (iv) empty. Theories having (i) or (ii) as the categoricity spectrum are called uncountably categorical. Totally categorical theories are those corresponding to (i) only. The same terms are used for models of such theories. The countable N0-categorical structures are characterized by the Byll-Nardzewski-Svenonius-Engeler theorem as those structures M for which there are only finitely many orbits under the action of Aut M on JH, for every n. This is in fact the only general theorem known in this case and there are no grounds for expecting a good general theory. We have an entirely different situation in the uncountably categorical case. Natural examples here are an algebraically closed field, a simple algebraic group over an algebraically closed field [19], a vector space

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Computability-theoretic Complexity of Trivial, Strongly Minimal Models

We show the existence of a trivial, strongly minimal (and thus uncountably categorical) theory for which the prime model is computable and each of the other countable models computes 0′′. This result shows that the result of Goncharov/Harizanov/Laskowski/Lempp/McCoy (2003) is best possible for trivial strongly minimal theories in terms of computable model theory. We conclude with some remarks a...

متن کامل

Finitely axiomatizable strongly minimal groups

We show that if G is a strongly minimal finitely axiomatizable group, the division ring of quasi-endomorphisms of G must be an infinite finitely presented ring. Questions about finite axiomatizability of first order theories are nearly as old as model theory itself and seem at first glance to have a fairly syntactical flavor. But it was in order to show that totally categorical theories cannot ...

متن کامل

Functorial semantics of topological theories

Following the categorical approach to universal algebra through algebraic theories, proposed by F.~W.~Lawvere in his PhD thesis, this paper aims at introducing a similar setting for general topology. The cornerstone of the new framework is the notion of emph{categorically-algebraic} (emph{catalg}) emph{topological theory}, whose models induce a category of topological structures. We introduce t...

متن کامل

Open Problems in the Theory of Constructive Algebraic Systems

In this paper we concentrate on open problems in two directions in the development of the theory of constructive algebraic systems. The first direction deals with universal algebras whose positive open diagrams can be computably enumerated. These algebras are called positive algebras. Here we emphasize the interplay between universal algebra and computability theory. We propose a systematic stu...

متن کامل

Constructive Models of Uncountably Categorical Theories

We construct a strongly minimal (and thus uncountably categorical) but not totally categorical theory in a nite language of binary predicates whose only constructive (or recursive) model is the prime model. 0. Introduction. E ective (or recursive) model theory studies to which degree constructions in model theory and algebra can be made e ective. A presentation of a countable model M is an isom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010